Path decomposition

Results: 318



#Item
221Graph drawing / Force-based algorithms / Graph / Power graph analysis / Path decomposition / Graph theory / Mathematics / Theoretical computer science

Improved Circular Layouts Emden R. Gansner and Yehuda Koren AT&T Labs — Research Florham Park, NJ 07932, USA {erg,yehuda}@research.att.com Abstract. Circular graph layout is a drawing scheme where all nodes are placed

Add to Reading List

Source URL: www.graphviz.org

Language: English - Date: 2012-02-16 11:23:45
222DOT language / Mathematical software / Graphviz / Tree / Force-based algorithms / Graph / Path decomposition / Graph rewriting / Graph theory / Mathematics / Graph drawing

PDF Document

Add to Reading List

Source URL: www.graphviz.org

Language: English - Date: 2012-02-16 11:23:45
223Topological graph theory / Graph / Force-based algorithms / Path decomposition / Pseudoforest / Graph theory / Graph drawing / Geometric graph theory

PDF Document

Add to Reading List

Source URL: rossshannon.com

Language: English - Date: 2010-02-05 14:05:39
224Combinatorial optimization / NP-complete problems / Network theory / Dynamic programming / Equations / Systems engineering / Tree decomposition / Graph / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

Optimal Cuts and Partitions in Tree Metrics in Polynomial Time Marek Karpinski∗ Andrzej Lingas†

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Language: English - Date: 2012-12-14 09:54:30
225Graph / Function / Connectivity / Algorithms for Recovery and Isolation Exploiting Semantics / Path decomposition / Median graph / Graph theory / Mathematics / Theoretical computer science

A Theory of Redo Recovery David Lomet Mark Tuttle Microsoft Research

Add to Reading List

Source URL: www.markrtuttle.com

Language: English - Date: 2007-04-26 00:00:00
226Graph / Neighbourhood / Signed graph / Matching / Degree / Minor / Covering graph / Path decomposition / Graph theory / Mathematics / Theoretical computer science

A Tight Lower Bound for k-Set Agreement Soma Chaudhuri Maurice Herlihyy Abstract: We prove tight bounds on the time needed

Add to Reading List

Source URL: www.markrtuttle.com

Language: English - Date: 2007-04-26 00:00:00
227Natural Resources Canada / Natural Sciences and Engineering Research Council / Graph theory / Path decomposition / Graph / Ryerson University / Combinatorics / Mathematics / Theoretical computer science / Higher education in Canada

Undergraduate Research Opportunities - Department of Mathematics (for potential NSERC or Ryerson URO Scholars) Deadline to apply: 4pm, FRIDAY, JANUARY 31, 2014 Supervisor Information Name and Title: Dr. Andrea Burgess

Add to Reading List

Source URL: math.ryerson.ca

Language: English - Date: 2013-12-17 11:37:33
228Directed graph / Planar graph / Outerplanar graph / Line graph / Path decomposition / Graph theory / Graph / Neighbourhood

1 Universit´ e de Bordeaux 1 Sciences et Technologies

Add to Reading List

Source URL: www.algant.eu

Language: English - Date: 2010-10-13 22:17:14
229Spanning tree / Routing algorithms / Minimum spanning tree / Floyd–Warshall algorithm / Shortest path problem / Adjacency matrix / Tree / Graph / Tree decomposition / Graph theory / Mathematics / Theoretical computer science

Matrices and graphs: Transitive closure 11 1

Add to Reading List

Source URL: www.jn.inf.ethz.ch

Language: English - Date: 2005-02-24 10:41:12
230Natural Resources Canada / Natural Sciences and Engineering Research Council / Graph theory / Path decomposition / Graph / Ryerson University / Combinatorics / Mathematics / Theoretical computer science / Higher education in Canada

Undergraduate Research Opportunities - Department of Mathematics (for potential NSERC or Ryerson URO Scholars) Deadline to apply: 4pm, FRIDAY, JANUARY 31, 2014 Supervisor Information Name and Title: Dr. Andrea Burgess

Add to Reading List

Source URL: www.math.ryerson.ca

Language: English - Date: 2013-12-17 11:37:33
UPDATE